Phase Complexity Surfaces: Characterizing Time-Varying Program Behavior
نویسندگان
چکیده
It is well known that a program execution exhibits time-varying behavior, i.e., a program typically goes through a number of phases during its execution with each phase exhibiting relatively homogeneous behavior within a phase and distinct behavior across phases. In fact, several recent research studies have been exploiting this time-varying behavior for various purposes. This paper proposes phase complexity surfaces to characterize a computer program’s phase behavior across various time scales in an intuitive manner. The phase complexity surfaces incorporate metrics that characterize phase behavior in terms of the number of phases, its predictability, the degree of variability within and across phases, and the phase behavior’s dependence on the time scale granularity.
منابع مشابه
Phase-based visualization and analysis of Java programs
Extant JVMs apply dynamic compiler optimizations adaptively, based on the partial execution of the program, with the goal of improving performance. Understanding and characterizing program behavior is of vital importance to such systems. Recent research, primarily in the area of computer architecture, has identified potential optimization opportunities in the repeating patterns in the time-vary...
متن کاملExploiting Program Phases
As ubiquitous computing continues to evolve, we are faced with the challenge of catering to the varied needs of an ever-increasing pool of diverse devices. Though the constraints and requirements for different devices may vary, performance and software quality are of paramount importance. Understanding program behavior is vital to both optimization amd program testing. Recently, there has been ...
متن کاملMeasurement of Complexity and Comprehension of a Program Through a Cognitive Approach
The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملThe Transient Behavior of LC and Ring Oscillators under External Frequency Injection
In this work, time domain analysis is used to solve Adler’s equation in order to obtain the required time, for an oscillator under external injection, reaching the steady-state condition. Mathematical approach has been applied to fully describe the transient of frequency acquisition in injection-locked LC and Ring oscillators considering their time-varying nature. Then, the analysis is verifie...
متن کامل